Multi-Site Timetabling

نویسنده

  • Ruben Gonzalez-Rubio
چکیده

Timetable construction in Universities is a moving target. De Werra [1] indicates that educational methods are driving changes in models and software applications, helping or constructing timetables. In this article we present a new timetable model which came from a new program in one Faculty at the Université de Sherbrooke. The basic difference of this new program compared with other instances of timetabling constructions in the University is that the courses in a term are taught at different sites instead of only one. In the case of one site all rooms are located in a single building, whereas in this new department the courses take place in three different sites. These sites are located in three cities (the longest distance between two sites being about 150 km). Some professors can teach at one site, some others can teach at two sites. For the moment nobody teaches at the three sites, but it could change, which means that the algorithm and the program must handle this possibility. One last special constraint is that in two sites there is one teleconference room, which means that in some cases a professor can give a lecture in both sites at the same time. This implies that the lecture can be taught to two sections at the same time. The article is organized as follows: First we introduce the current model for courses timetabling, then we show the new model to make clear where the differences are. Next, we present the steps that we follow to integrate the functionality of multi-site problem. After that we present how DIAMANT was modified to take into account the new data and the new algorithm, followed with a discussion of the experience. We end with a conclusion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

متن کامل

Genetic Algorithms for University Course Timetabling Problems

The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...

متن کامل

Multi-objective aspects of the examination timetabling competition track

We investigate multi-objective aspects of the new examination timetabling model introduced as part of the 2007 International Timetabling Competition. We propose one way to group together the objectives to represent the separate interests of the students and administration, and produce an example of an associated (Pareto) trade-off curve.

متن کامل

Generating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms

UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...

متن کامل

A Review of Distributed Multi-Agent Systems Approach to Solve University Course Timetabling Problem

Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006